Attack on Fully Homomorphic Encryption over the Integers
نویسنده
چکیده
Received Jul 17 th , 2012 Accepted Aug 26 th , 2012 Recently, many fully-homomorphic encryption schemes have been constructed. However, the issue of the security of these fully homomorphic encryptions has not been carefully studied. By using lattice reduction algorithm, we firstly present an attack on the fully homomorphic encryption based on approximate GCD over the integers. Our result shows that the FHE in [4] is not secure for some parameter settings. Then, we define approximate matrix GCD problem, which is a generalization of approximate GCD. Finally, we construct an improvement FHE scheme based on approximate matrix GCD to avoid the lattice attack in this paper. Keyword:
منابع مشابه
Attack on Fully Homomorphic Encryption over the Integers
This paper presents a heuristic attack on the fully homomorphic encryption over the integers by using lattice reduction algorithm. Our result shows that the FHE in [DGHV10] is not secure for some parameter settings. We also present an improvement scheme to avoid the lattice attack in this paper.
متن کاملOn the CCA-1 Security of Somewhat Homomorphic Encryption over the Integers
The notion of fully homomorphic encryption is very important since it enables many important applications, such as the cloud computing scenario. In EUROCRYPT 2010, van Dijk, Gentry, Halevi and Vaikuntanathan proposed an interesting fully homomorphic encryption scheme based on a somewhat homomorphic encryption scheme using integers. In this paper, we demonstrate a very practical CCA-1 attack aga...
متن کاملLattice Attacks on the DGHV Homomorphic Encryption Scheme
In 2010, van Dijk, Gentry, Halevi, and Vaikuntanathan described the first fully homomorphic encryption over the integers, called DGHV. The scheme is based on a set of m public integers ci = pqi + ri, i = 1, · · · ,m, where the integers p, qi and ri are secret. In this paper, we describe two lattice-based attacks on DGHV. The first attack is applicable when r1 = 0 and the public integers ci sati...
متن کاملReaction Attack on Outsourced Computing with Fully Homomorphic Encryption Schemes
Outsourced computations enable more efficient solutions towards practical problems that require major computations. Nevertheless, users’ privacy remains as a major challenge, as the service provider can access users’ data freely. It has been shown that fully homomorphic encryption schemes might be the perfect solution, as it allows one party to process users’ data homomorphically, without the n...
متن کاملNew Fully Homomorphic Encryption over the Integers
We first present a fully homomorphic encryption scheme over the integers, which modifies the fully homomorphic encryption scheme in [vDGHV10]. The security of our scheme is merely based on the hardness of finding an approximate-GCD problem over the integers, which is given a list of integers perturbed by the small error noises, removing the assumption of the sparse subset sum problem in the ori...
متن کامل